abstract class $NR_STACK{T} < $DISPENSER{T} |
---|
**** | An abstract stack |
$DISPENSER{_} | $STR | $CONTAINER{_} | $ELT{_} | $ELT |
$STACK{_} | A_STACK{_} |
copy: $NR_STACK{T}; |
---|
**** | Return a copy of the stack |
elt!: T; |
---|
**** | Return the elements in the order in which successive "pop"s would yield them without actually removing the elements |
is_empty: BOOL; |
---|
**** | True if size = 0 |
pop: T; |
---|
**** | Return and remove the topmost element |
push(elt: T); |
---|
**** | Push elt to the top of the stack |
size: INT; |
---|
**** | Number of elements in the stack |
top: T; |
---|
**** | Return the topmost element |